Convolutional Embedding of Attributed Molecular Graphs for Physical Property Prediction
نویسندگان
چکیده
منابع مشابه
Symbolic Attributed Graphs for Attributed Graph Transformation
In this paper we present a new approach to deal with attributed graphs and attributed graph transformation. This approach is based on working with what we call symbolic graphs, which are graphs labelled with variables together with a formula that constrains the possible values that we may assign to these variables. In particular, in this paper we will compare in detail this new approach with th...
متن کاملAttributed Social Network Embedding
Embedding network data into a low-dimensional vector space has shown promising performance for many real-world applications, such as node classification and entity retrieval. However, most existing methods focused only on leveraging network structure. For social networks, besides the network structure, there also exists rich information about social actors, such as user profiles of friendship n...
متن کاملAccelerated Attributed Network Embedding
Network embedding is to learn low-dimensional vector representations for nodes in a network. It has shown to be effective in a variety of tasks such as node classification and link prediction. While embedding algorithms on pure networks have been intensively studied, in many real-world applications, nodes are often accompanied with a rich set of attributes or features, aka attributed networks. ...
متن کاملSimplE Embedding for Link Prediction in Knowledge Graphs
The aim of knowledge graphs is to gather knowledge about the world and provide a structured representation of this knowledge. Current knowledge graphs are far from complete. To address the incompleteness of the knowledge graphs, link prediction approaches have been developed which make probabilistic predictions about new links in a knowledge graph given the existing links. Tensor factorization ...
متن کاملBorrowed Contexts for Attributed Graphs
Borrowed context graph transformation is a simple and powerful technique developed by Ehrig and König that allow us to derive labeled transitions and bisimulation congruences for graph transformation systems or, in general, for process calculi that can be defined in terms of graph transformation systems. Moreover, the same authors have also shown how to use this technique for the verification o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Chemical Information and Modeling
سال: 2017
ISSN: 1549-9596,1549-960X
DOI: 10.1021/acs.jcim.6b00601